|
In mathematics, the Dyson conjecture is a conjecture about the constant term of certain Laurent polynomials, proved by Wilson and Gunson. Andrews generalized it to the q-Dyson conjecture, proved by Zeilberger and Bressoud and sometimes called the Zeilberger–Bressoud theorem. Macdonald generalized it further to more general root systems with the Macdonald constant term conjecture, proved by Cherednik. ==Dyson conjecture== The Dyson conjecture states that the Laurent polynomial : has constant term : The conjecture was first proved independently by and . later found a short proof, by observing that the Laurent polynomials, and therefore their constant terms, satisfy the recursion relations : The case ''n'' = 3 of Dyson's conjecture follows from the Dixon identity. and used a computer to find expressions for non-constant coefficients of Dyson's Laurent polynomial. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Dyson conjecture」の詳細全文を読む スポンサード リンク
|